Improved Inclusion-Exclusion Identities and Inequalities Based on a Particular Class of Abstract Tubes
نویسنده
چکیده
Recently, Naiman and Wynn introduced the concept of an abstract tube in order to obtain improved inclusion-exclusion identities and inequalities that involve much fewer terms than their classical counterparts. In this paper, we introduce a particular class of abstract tubes which plays an important role with respect to chromatic polynomials and network reliability. The inclusionexclusion identities and inequalities associated with this class simultaneously generalize several wellknown results such as Whitney’s broken circuit theorem, Shier’s expression for the reliability of a network as an alternating sum over chains in a semilattice and Narushima’s inclusion-exclusion identity for posets. Moreover, we show that under some restrictive assumptions a polynomial time inclusion-exclusion algorithm can be devised, which generalizes an important result of Provan and Ball on network reliability. AMS 1991 subject classifications. 05A19, 05A20, 05C15, 60C05, 68M15, 90B12, 90B25.
منابع مشابه
Improved Inclusion-exclusion Inequalities for Simplex and Orthant Arrangements
Improved inclusion-exclusion inequalities for unions of sets are available wherein terms usually included in the alternating sum formula can be left out. This is the case when a key abstract tube condition, can be shown to hold. Since the abstract tube concept was introduced and refined by the authors, several examples have been identified, and key properties of abstract tubes have been describ...
متن کاملImproved Inclusion-Exclusion Identities and Bonferroni Inequalities with Applications to Reliability Analysis of Coherent Systems
متن کامل
On finding a particular class of combinatorial identities
In this paper, a class of combinatorial identities is proved. A method is used which is based on the following rule: counting elements of a given set in two ways and making equal the obtained results. This rule is known as " counting in two ways ". The principle of inclusion and exclusion is used for obtaining a class of (0, 1)−matrices. A modification of the method of " counting in two ways " ...
متن کاملImproved inclusion-exclusion identities via closure operators
Improved inclusion-exclusion identities via closure operators Klaus Dohmen Department of Computer Science, Humboldt-University Berlin, Unter den Linden 6, D-10099 Berlin, Germany E-mail: [email protected] received March 24, 1999, revised September 6, 1999, accepted April 15, 2000. Let be a finite family of sets. We establish an improved inclusion-exclusion identity for each closure...
متن کاملImproved Bonferroni Inequalities via Abstract Tubes - ReadingSample
1 Introduction and Overview Many problems in combinatorics, number theory, probability theory, reliability theory and statistics can be solved by applying a unifying method, which is known as the principle of inclusion-exclusion. The principle of inclusion-exclusion expresses the indicator function of a union of finitely many sets as an alternating sum of indicator functions of their intersecti...
متن کامل